Low Power Reversible Parallel Binary Adder/Subtractor

In recent years, Reversible Logic is becoming more and more prominent technology having its applications in Low Power CMOS, Quantum Computing, Nanotechnology, and Optical Computing. Reversibility plays an important role when energy efficient computations are considered. In this paper, Reversible eight-bit Parallel Binary Adder/Subtractor with Design I, Design II and Design III are proposed. In all the three design approaches, the full Adder and Subtractors are realized in a single unit as compared to only full Subtractor in the existing design. The performance analysis is verified using number reversible gates, Garbage input/outputs and Quantum Cost. It is observed that Reversible eight-bit Parallel Binary Adder/Subtractor with Design III is efficient compared to Design I, Design II and existing design.Comment: 12 pages,VLSICS Journa

PCAD: Power control attack detection in wireless sensor networks

Security in wireless sensor networks is critical due to its way of open communication. In this paper we have provided a solution to detect malicious nodes which perform radio transmission power control attack and sinkhole attack in wireless sensor networks. In the proposed approach, data transmission is divided into multiple rounds of equal time duration. Each node chooses the parent node in the beginning of the round for forwarding the packet towards sink. Each node adds its identity in the packet as a routing path marker and encrypts before forwarding to parent. Child node observes the parent, handles acknowledgement from 2-hop distance node and decides the trust on parent based on successful and unsuccessful transactions. Each node sends a trust value report via multiple paths to Sink at the end of the round. Sink identifies the malicious node by comparing trust value report received from each node with number of data packets received. Simulated the algorithm in NS-3 and performance analysis compared with other recently proposed approach. Simulation results show that proposed method detect the malicious nodes efficiently and early. © 2016 IEEE

CPMTS: Catching packet modifiers with trust support in wireless sensor networks

Security in wireless sensor networks is critical due to its way of open communication. Packet modification is a common attack in wireless sensor networks. In literature, many schemes have been proposed to mitigate such an attack but very few detect the malicious nodes effectively. In the proposed approach, each node chooses the parent node for forwarding the packet towards sink. Each node adds its identity and trust on parent as a routing path marker and encrypts only the bytes added by node in packet before forwarding to parent. Sink can determine the modifiers based on trust value and node identities marked in packet. Child node observes the parent and decides the trust on parent based on successful and unsuccessful transactions. Data transmission is divided into multiple rounds of equal time duration. Each node chooses the parent node at the beginning of a round based on its own observation on parent. Simulated the algorithm in NS-3 and performance analysis is discussed. With the combination of trust factor and fixed path routing to detect malicious activity, analytical results show that proposed method detect modifiers efficiently and early, and also with low percentage of false detection

CMNTS: Catching malicious nodes with trust support in wireless sensor networks

Security in wireless sensor networks is critical due to its way of open communication. In this paper we have considered suite of attacks - packet modification, packet dropping, sybil attack, packet misrouting, and bad mouthing attack, and provided a solution to detect attacks. In literature, many schemes have been proposed to mitigate such attacks but very few detect the malicious nodes effectively and also no single solution detects all attacks. In the proposed approach, each node chooses the parent node for forwarding the packet towards sink. Each node adds its identity and trust on parent as a routing path marker and encrypts only the bytes added by node in packet before forwarding to parent. Sink can identify the malicious node based on trust value and node identities marked in packet. Child node observes the parent and decides the trust on parent based on successful and unsuccessful transactions. Data transmission is divided into multiple rounds of equal time duration. Each node chooses the parent node at the beginning of a round based on its own observation on parent. Simulated the algorithm in NS-3 and performance analysis is discussed by comparing the results with other two recently proposed approaches. With the combination of trust factor and fixed path routing to detect malicious activity, simulation results show that proposed method detect malicious nodes efficiently and early, and also with low percentage of false detection

SDLM: Source detection based local monitoring in wireless sensor networks

Security in wireless sensor networks is critical due to its way of open communication. Local monitoring is one of the powerful technique to secure the data and detect various malicious activities. In local monitoring, neighbour nodes observe the communication between current sender, current receiver and next hop receiver to detect the malicious activity. To make sensors power efficient, sleep-wake scheduling algorithms along with local monitoring are suggested in literature. Solutions in the literature do not address the problem if source node is malicious and do not consider unnecessary wake up of the nodes as malicious activity. This paper tries to achieve without assuming source node as honest and considers unnecessary wake up of the node as a malicious activity. Simulated the algorithm in NS-2 and performance analysis is discussed. Even with additional checks applied to detect malicious activities, analytical results show no degradation in the performance

Two Dimensional Quantum Mechanical Modeling of Nanotransistors

Quantization in the inversion layer and phase coherent transport are anticipated to have significant impact on device performance in 'ballistic' nanoscale transistors. While the role of some quantum effects have been analyzed qualitatively using simple one dimensional ballistic models, two dimensional (2D) quantum mechanical simulation is important for quantitative results. In this paper, we present a framework for 2D quantum mechanical simulation of a nanotransistor / Metal Oxide Field Effect Transistor (MOSFET). This framework consists of the non equilibrium Green's function equations solved self-consistently with Poisson's equation. Solution of this set of equations is computationally intensive. An efficient algorithm to calculate the quantum mechanical 2D electron density has been developed. The method presented is comprehensive in that treatment includes the three open boundary conditions, where the narrow channel region opens into physically broad source, drain and gate regions. Results are presented for (i) drain current versus drain and gate voltages, (ii) comparison to results from Medici, and (iii) gate tunneling current, using 2D potential profiles. Methods to reduce the gate leakage current are also discussed based on simulation results.Comment: 12 figures. Journal of Applied Physics (to appear

DMN2SC: Detecting Malicious Nodes with 2-hop Secure Channel Support in Wireless Sensor Networks

Security in wireless sensor networks is critical due to its way of open communication. In this paper we have considered suite of attacks and provided a solution to detect malicious nodes. In literature, many schemes have been proposed to mitigate such attacks but very few detect the malicious nodes effectively and also no single solution detects all attacks. In the proposed approach, each node chooses the parent node for forwarding the packet towards Sink. Each node adds its identity as a routing path marker and encrypts only the bytes added by a node in packet before forwarding to parent. Child node observes the parent, handles acknowledgement from 2-hop distance node and decides the trust on parent based on successful and unsuccessful transactions. Data transmission is divided into multiple rounds of equal time duration. Each node sends a trust value report via multiple paths to Sink at the end of each round. Sink identifies the malicious node based on the number of packets a node participates in forwarding and also based on the trust value report sent from each node for its parent. Each node chooses the parent node at the beginning of a round based on its own observation on parent to recover itself from malicious parent node. With the combination of trust factor, 2-hop acknowledgement and fixed path routing to detect malicious activity, simulation results show that proposed method detect malicious nodes efficiently and early, and also with low percentage of false detection, compared to other recently proposed approaches

Levels and Correlates of Non-Adherence to WHO Recommended Inter-Birth Intervals in Rufiji, Tanzania.

Poorly spaced pregnancies have been documented worldwide to result in adverse maternal and child health outcomes. The World Health Organization (WHO) recommends a minimum inter-birth interval of 33 months between two consecutive live births in order to reduce the risk of adverse maternal and child health outcomes. However, birth spacing practices in many developing countries, including Tanzania, remain scantly addressed. METHODS: Longitudinal data collected in the Rufiji Health and Demographic Surveillance System (HDSS) from January 1999 to December 2010 were analyzed to investigate birth spacing practices among women of childbearing age. The outcome variable, non-adherence to the minimum inter-birth interval, constituted all inter-birth intervals <33 months long. Inter-birth intervals >=33 months long were considered to be adherent to the recommendation. Chi-Square was used as a test of association between non-adherence and each of the explanatory variables. Factors affecting non-adherence were identified using a multilevel logistic model. Data analysis was conducted using STATA (11) statistical software. RESULTS: A total of 15,373 inter-birth intervals were recorded from 8,980 women aged 15--49 years in Rufiji district over the follow-up period of 11 years. The median inter-birth interval was 33.4 months. Of the 15,373 inter-birth intervals, 48.4% were below the WHO recommended minimum length of 33 months between two live births. Non-adherence was associated with younger maternal age, low maternal education, multiple births of the preceding pregnancy, non-health facility delivery of the preceding birth, being an in-migrant resident, multi-parity and being married. CONCLUSION: Generally, one in every two inter-birth intervals among 15--49 year-old women in Rufiji district is poorly spaced, with significant variations by socio-demographic and behavioral characteristics of mothers and newborns. Maternal, newborn and child health services should be improved with a special emphasis on community- and health facility-based optimum birth spacing education in order to enhance health outcomes of mothers and their babies, especially in rural settings

Machine-Part cell formation through visual decipherable clustering of Self Organizing Map

Machine-part cell formation is used in cellular manufacturing in order to process a large variety, quality, lower work in process levels, reducing manufacturing lead-time and customer response time while retaining flexibility for new products. This paper presents a new and novel approach for obtaining machine cells and part families. In the cellular manufacturing the fundamental problem is the formation of part families and machine cells. The present paper deals with the Self Organising Map (SOM) method an unsupervised learning algorithm in Artificial Intelligence, and has been used as a visually decipherable clustering tool of machine-part cell formation. The objective of the paper is to cluster the binary machine-part matrix through visually decipherable cluster of SOM color-coding and labelling via the SOM map nodes in such a way that the part families are processed in that machine cells. The Umatrix, component plane, principal component projection, scatter plot and histogram of SOM have been reported in the present work for the successful visualization of the machine-part cell formation. Computational result with the proposed algorithm on a set of group technology problems available in the literature is also presented. The proposed SOM approach produced solutions with a grouping efficacy that is at least as good as any results earlier reported in the literature and improved the grouping efficacy for 70% of the problems and found immensely useful to both industry practitioners and researchers.Comment: 18 pages,3 table, 4 figure